View Equivalence

Definition 3.9 View Equivalence

Let $ s and $ s'be two schedules. $ sand $ s'are called view equivalent, denoted $ s \approx_v s' if the following holds:

1. $ op(s) = op(s'),

2. $ H(s) = H(s'),

3. $ H_s(p) = H_{s'}(p) for all read or write steps $ p.

1. 2のみだとFinal State Equivalenceと同じ．

3が追加の制約．

Theorem 3.2

Let $ sand $ s'be schedules. The following three statements are pairwise equivalent:

1. $ s \approx_v s'

2. $ D(s) = D(s')

3. $ RF(s) = RF(s')

$ D(s)はReduced Dead Step Graphのこと．1 = 3 が重要で．2は忘れていいかも

つまり，Reads-Fromが一致する2つのScheduleは，View Equvalentであるといえる．